Secure joint source-channel coding with interference known at the transmitter

نویسندگان

  • Ghadamali Bagherikaram
  • Konstantinos N. Plataniotis
چکیده

In this study, the problem of transmitting an independent and identically distributed (i.i.d.) Gaussian source over an i.i.d. Gaussian wire-tap channel, with an i.i.d. Gaussian known interference available at the transmitter is considered. The intended receiver is assumed to have a certain minimum signal-to-noise ratio (SNR) and the eavesdropper is assumed to have a strictly lower SNR compared to the intended receiver. The objective is to minimise the distortion of source reconstruction at the intended receiver. In this study, an achievable distortion is derived when Shannon’s source–channel separation coding scheme is used. Three hybrid digital–analogue secure joint source–channel coding schemes are then proposed, which achieve the same distortion. The first coding scheme is based on Costa’s dirty-paper-coding scheme and wire-tap channel coding scheme, when the analogue source is not explicitly quantised. The second coding scheme is based on the superposition of the secure digital signal and the hybrid digital–analogue signal. It is shown that for the problem of communicating a Gaussian source over a Gaussian wire-tap channel with side information, there exists an infinite family of secure joint source–channel coding schemes. In the third coding scheme, the quantised signal and the analogue error signal are explicitly superimposed. It is shown that this scheme provides an infinite family of secure joint source–channel coding schemes with a variable number of binning. Finally, the proposed secure hybrid digital–analogue schemes are analysed under the main channel SNR mismatch. It is proven that the proposed schemes can give a graceful degradation of distortion with SNR under SNR mismatch, that is, when the actual SNR is larger than the designed SNR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On The Secrecy of the Cognitive Interference Channel with Channel State

In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...

متن کامل

Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference

Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios‎. First, it is shown that the additive Gaussian ch...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

Joint source-channel coding for transmitting correlated sources over broadcast networks

We consider a set of S independent encoders that must transmit a set of correlated sources through a network of noisy, independent, broadcast channels to T receivers, with no interference at the receivers. For the general problem of sending correlated sources through broadcast networks, it is known that the source–channel separation theorem breaks down and the achievable rate region as well as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IET Communications

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2012